翻訳と辞書 |
Least slack time scheduling : ウィキペディア英語版 | Least slack time scheduling
Least slack time (LST) scheduling is a scheduling algorithm. It assigns priority based on the ''slack time'' of a process. Slack time is the amount of time left after a job if the job was started now. This algorithm is also known as least laxity first. Its most common use is in embedded systems, especially those with multiple processors. It imposes the simple constraint that each process on each available processor possesses the same run time, and that individual processes do not have an affinity to a certain processor. This is what lends it a suitability to embedded systems. ==Slack time== This scheduling algorithm first selects those processes that have the smallest "slack time". Slack time is defined as the temporal difference between the deadline, the ready time and the run time. More formally, the ''slack time'' for a process is defined as:
where is the process deadline, is the real time since the cycle start, and is the remaining computation time.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Least slack time scheduling」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|